Cyclic Association Rules Mining under Constraints
نویسندگان
چکیده
منابع مشابه
Cyclic Association Rules Mining under Constraints
Several researchers have explored the temporal aspect of association rules mining. In this paper, we focus on the cyclic association rules, in order to discover correlations among items characterized by regular cyclic variation overtime.The overview of the state of the art has revealed the dra wbacks of proposed algorithm literatures, namely the excessive number of generated rules which are not...
متن کاملMining Association Rules under Privacy Constraints
Data mining services require accurate input data for their results to be meaningful, but privacy concerns may impel users to provide spurious information. In this chapter, we study whether users can be encouraged to provide correct information by ensuring that the mining process cannot, with any reasonable degree of certainty, violate their privacy. Our analysis is in the context of extracting ...
متن کاملUser Constraints in Discovering Association Rules Mining
This paper introduces a new algorithm called User Association Rules Mining (UARM) for solving the problem of generating inadequate large number of rules in mining association technique using a fuzzy logic method [1, 2]. In order to avoid user’s defined threshold mistakes, the user has flexibility to determine constraints based on a set of features. In comparison with other well-known and widely...
متن کاملMining Association Rules with Item Constraints
The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In practice, users are often interested in a subset of association rules. For example, they may only want rules that contain a speci c item or rules that contain children of a speci c item in a hierarchy. While such constraints c...
متن کاملMining Class-Association Rules with Constraints
Numerous fast algorithms for mining class-association rules (CARs) have been developed recently. However, in the real world, end-users are often interested in a subset of class-association rules. Particularly, they may consider only rules that contain a specific item or a specific set of items. The nave strategy is to apply such item constraints into the post-processing step. However, such appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/7889-1253